#pragma once
#include<iostream>
#include<vector>
using namespace std;

#define Max_size 111
class Graph
{
	int _edge[Max_size][Max_size];
	int _vertex[Max_size];
public:
	bool Adjucent(int begin, int end)
	{
		if (_edge[begin][end]) return true;
		return false;
	}
	vector<pair<int, int>> Neighbors(int cur)
	{

	}
	bool InsertVertex(int ver)
	{
		if (ver >= Max_size || ver < 0) return false;
		_vertex[ver] = 1;
		return true;
	}
	bool DeleteVertex(int ver)
	{
		if (ver >= Max_size || ver < 0) return false;
		_vertex[ver] = 0;
		
	}
	bool AddEdge(int begin, int end)
	{
		_edge[begin][end] = 1;
		_edge[end][begin] = 1;
		return true;
	}
	bool RemoveEdge(int begin, int end)
	{
		_edge[begin][end] = 0;
		_edge[end][begin] = 0;
		return true;
	}
	int FirstNeighbor(int cur)
	{

	}
	int NextNeighbor(int cur)
	{

	}
	int Get_edge_value(int begin, int end)
	{
		return _edge[begin][end];
	}
	bool Set_edge_value(int begin, int end)
	{
		_edge[begin][end] = _edge[end][begin];
	}
};
